Python loops

The following topics are covered: While Loops For Loops Nested loops Break and continue Loops else enumerate() Applications: Turtle library with loops and decision procedures. Prior knowledge of variables, assignments, expressions, input-output, lists, and conditionals is recommended. For CS0 students. Part of the CUNY CS04All project

Python if statements

Python If-else branches, equality and relational operators, and some additional topics: Boolean operators and expressions, membership and identity operators. Prior knowledge of variables, assignments, and expressions is recommended. For CS0 students. Part of the CUNY CS04All project

Python dictionary

This is an introduction Python dictionary, using Python 3. Prior knowledge of input/output in Python, and Python list is recommended. For CS0 students. Part of the CUNY CS04All project

Python working with files

This is an introduction to work with files in Python. Prior knowledge of variables, assignments, expressions, input-output, lists, conditionals, and loops is recommended. For CS0 students. Part of the CUNY CS04All project

Python input output

The following topics are discussed: Development Environment Basic input and output Variables and assignments Python expressions Division and modulo Math module For CS0 students. Part of the CUNY CS04All project

Python string

An introduction to Python strings and string formatting. Proposed lecture slides are supplied with in-class activity, homework assignment, and assessment. No loops, no decision structures. For CS0 students. Part of the CUNY CS04All project

Computer-Aided Reasoning about Knowledge and Justifications

In the first Chapter we compare two well-known type-based computer frameworks for computer aided logical reasoning and verification: MetaPRL and Coq. In particular, we implement in MetaPRL the Calculus of Inductive Constructions which is the theoretical base for Coq. This work has shown the common points of MetaPRL and Coq, and revealed their principal methodological differences. A possible application of this work is a possibility to perform re-validation in MetaPRL of the existing library of Coq proofs which could help to build more trust in the latter. Chapter 2 is the main contribution of the dissertation. It contains the description and testing results of an implementation of realization algorithm in epistemic modal logic that converts cut-free derivations in multi-agent epistemic modal logic into derivations in the corresponding Justification Logic where witnesses of knowledge (justification terms) are recovered for all instances of common knowledge. We also apply this algorithms to several well-known epistemic puzzles, such as Muddy Children, Wise Men, Wise Girls, etc

Python list

A brief introduction to Python list. No loops, no decision structures. For CS0 students. Part of the CUNY CS04All project